Minkowski sum boundary surfaces of 3D-objects
نویسندگان
چکیده
Given two solids A and B with piecewise smooth boundary we discuss the computation of the boundary Γ of the Minkowski sum A + B. This boundary surface Γ is part of the envelope when B is moved by translations defined by vectors a ∈ A, or vice versa. We present an efficient algorithm working for dense point clouds or for triangular meshes. Besides this, the global self intersections of the boundary Γ are detected and resolved. Additionally we point to some relations between Minkowski sums and kinematics, and compute local quadratic approximations of the envelope. keywords: Minkowski sum, convolution surface, translation, motion, envelope, marching algorithm, point-set surface, signed distance function.
منابع مشابه
Voxelized Minkowski sum computation on the GPU with robust culling
We present a new approach for computing the voxelized Minkowski sum (excluding any enclosed voids) of two polyhedral objects using programmable Graphics Processing Units (GPUs). We first cull out surface primitives that will not contribute to the final boundary of the Minkowski sum, analyzing and adaptively bounding the rounding errors of the culling algorithm to solve the floating point error ...
متن کاملPolynomial/Rational Approximation of Minkowski Sum Boundary Curves
Given two planar curves, their convolution curve is defined as the set of all vector sums generated by all pairs of curve points which have the same curve normal direction. The Minkowski sum of two planar objects is closely related to the convolution curve of the two object boundary curves. That is, the convolution curve is a superset of the Minkowski sum boundary. By eliminating all redundant ...
متن کاملPolynomial/Rational Approximation of Minkowski Sum Boundary Curves 1
Given two planar curves, their convolution curve is defined as the set of all vector sums generated by all pairs of curve points which have the same curve normal direction. The Minkowski sum of two planar objects is closely related to the convolution curve of the two object boundary curves. That is, the convolution curve is a superset of the Minkowski sum boundary. By eliminating all redundant ...
متن کاملComputing global visibility maps for regions on the boundaries of polyhedra using Minkowski sums
A global visibility map is a spherical image built to describe the complete set of global visible view directions for a surface. In this paper, we consider the computation of global visibility maps for regions on the boundary of a polyhedron. Both the self-occlusions introduced by a region and the global occlusions introduced by the rest of the surfaces on the boundary of the polyhedron are con...
متن کاملConic Approximation of Convolution Curve
Given two planar curves, a convolution curve is computed by applying vector sums to all pairs of curve points which have the same curve normal direction. The convolution curve can be used to compute Minkowski sum of two planar objects which is important in various geometric computations such as collision detection and font design. In this paper, we present an algorithm to generate a conic appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphical Models
دوره 69 شماره
صفحات -
تاریخ انتشار 2007